Automatic Theorem Proving in Walnut
نویسنده
چکیده
2 Basics 3 2.1 Words and Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Number Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Automatic Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Automata accepting Predicates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملCritical exponents of infinite balanced words
Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2 + √ 2/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5 + √ 5)/4. Over larger alphabets, we give some candidates for balanced words (found computationally) having small critical exponents. We also explore a method for proving these results using the automated t...
متن کاملProof-Checking, Theorem-Proving, and Program Verification
This article consists of three parts: a tutorial introduction to a computer program that proves theorems by induction; a brief description of recent applications of that theorem-prover; and a discussion of several nontechnical aspects of the problem of building automatic theorem-provers. The theorem-prover described has proved theorems such as the uniqueness of prime factorizations, Fermat’s th...
متن کاملThe Moment of Truth, in Automatic Theorem Proving in Elementary Geometry
While still being an active field of research, automatic theorem proving in elementary geometry has reached a certain status of maturity. Software and hardware requirements to successfully (and quickly) perform hundreds of interesting examples are now widespread available (such as GEX, Geother, GDI, etc.) Yet, in recent years, a few papers ([BDR],[BFS], [CT1], [CT2]) have repeatedly expressed t...
متن کاملImporting the Results of Automatic Hardware Veri cation into HOL
Formal hardware veri cation systems can be split into two categories: theorem proving systems and automatic nite state machine based systems. Each approach has its own complementary advantages and disadvantages. In this paper, we consider the combination of two such systems: HOL (a theorem proving system) and MDG (an automatic system). As HOL hardware veri cation proofs are based on the hierarc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.06017 شماره
صفحات -
تاریخ انتشار 2016